Eccentricity Based Topological Indices of an Oxide Network
نویسندگان
چکیده
منابع مشابه
Comparison Between Two Eccentricity-based Topological Indices of Graphs
For a connected graph G, the eccentric connectivity index (ECI) and the first Zagreb eccentricity index of G are defined as ( ) ( ) deg ( ) ( ) i c G i G i v V G ξ G v ε v and ( 2 1 ) ( ) ( ) i G i v G V E G ε v , respectively, where deg ( ) G i v is the degree of i v in G and ( ) G i ε v denotes the eccentricity of vertex i v in G. In this paper we compare the eccentric connectivity ...
متن کاملEccentricity based Topological Feature Extraction
The eccentricity transform associates to each point of a shape the geodesic distance to the points farthest away. This can be used to decompose shapes into parts based on the connectivity of the isoheight lines. The adjacency graph of the obtained decomposition is similar to a Reeb graph and characterizes the topology of the object. Graph pyramids are used to efficiently compute the decompositi...
متن کاملM-polynomial and degree-based topological indices
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملDistance-based topological indices of tensor product of graphs
Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2018
ISSN: 2227-7390
DOI: 10.3390/math6070126